Turing reduction - PDFSEARCH.IO - Document Search Engine

Turing reduction
Results: 43

#	Item
21	NO TURING MACHINE CAN REPLICATE AN ARBITRARILY CHOSEN TURING MACHINE BY OBSERVING ITS RESPONSES Kerry M. Soileau November 9, 2005 ABSTRACT Add to Reading List Source URL: www.kerrysoileau.com Language: English - Date: 2008-09-08 17:17:41 Computability theory Theory of computation Models of computation Turing machine Alan Turing Computability Hyperconnected space Reduction NP Theoretical computer science Applied mathematics Computer science
22	Reductions between Disjoint NP-Pairs Christian Glaßer ∗ ¨ Informatik IV Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2003-04-21 14:49:45 Computability theory Structural complexity theory Complexity classes Mathematical optimization NP-complete P versus NP problem Turing reduction Oracle machine Time complexity Theoretical computer science Computational complexity theory Applied mathematics
23	Π01 CLASSES AND STRONG DEGREE SPECTRA OF RELATIONS JOHN CHISHOLM, JENNIFER CHUBB, VALENTINA S. HARIZANOV, DENIS R. HIRSCHFELDT, CARL G. JOCKUSCH, JR., TIMOTHY MCNICHOLL, AND SARAH PINGREY Abstract. We study the weak tru Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2009-07-29 17:57:30 Mathematics Computer science Turing reduction Low Computable function Turing degree Function Recursive set Enumeration Computability theory Theoretical computer science Theory of computation
24	GENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY CARL G. JOCKUSCH, JR. AND PAUL E. SCHUPP Abstract. Generic decidability has been extensively studied in group theory, and we now study it in the context of cl Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2013-02-15 20:06:55 Mathematics Computer science Computable function Recursive set Computation in the limit Generic-case complexity Turing reduction Halting problem Blum axioms Computability theory Theoretical computer science Theory of computation
25	DIAGONALLY NON-COMPUTABLE FUNCTIONS AND BI-IMMUNITY CARL G. JOCKUSCH, JR. AND ANDREW E.M. LEWIS Abstract. We prove that every diagonally noncomputable function computes a set A which is bi-immune, meaning that neither A Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2013-02-02 15:47:48 Applied mathematics Computable function Turing reduction Reduction Algorithmically random sequence Function Computability theory Mathematics Computer science
26	On Self-Embeddings of Computable Linear Orderings ? Rodney G. Downey a , Carl Jockusch b and Joseph S. Miller a a School of Mathematical and Computing Sciences Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2009-07-29 17:54:43 Mathematical logic Theory of computation Computable function Halting problem Turing reduction Reverse mathematics Embedding Ordinal number Computability theory Mathematics Theoretical computer science
27	DEFINABILITY VIA KALIMULLIN PAIRS IN THE STRUCTURE OF THE ENUMERATION DEGREES HRISTO A. GANCHEV† AND MARIYA I. SOSKOVA†‡ Add to Reading List Source URL: www.fmi.uni-sofia.bg Language: English - Date: 2013-01-04 08:54:41 Turing degree Recursively enumerable set Turing reduction Reduction Structure Order Computability theory Mathematics Enumeration
28	Axiomatising physical experiments as oracles to algorithms Edwin J. Beggsa , Jos´e F´elix Costab∗ , and John V. Tuckerc a Department of Mathematics, College of Sciences, Swansea University, Swansea SA2 8PP, Wales, Un Add to Reading List Source URL: www-compsci.swan.ac.uk Language: English - Date: 2012-04-11 07:58:28 Computability theory Complexity classes Models of computation Alan Turing Oracle machine Turing reduction John V. Tucker Probabilistic Turing machine Reduction Theoretical computer science Applied mathematics Computational complexity theory
29	PROGRAMME Sunday, 19 July 2009 CiE 2009 Mathematical Theory and Add to Reading List Source URL: www.math.uni-heidelberg.de Language: English - Date: 2009-07-30 07:35:12 Computer science Mathematics Hypercomputation Mathematical logic Algorithm Computable number Recursively enumerable set Turing reduction Computability Theory of computation Computability theory Theoretical computer science
30	The Turing universe in the context of enumeration reducibility Mariya I. Soskova Sofia University and University of California, Berkeley A fundamental goal of computability theory is to understand the way that Add to Reading List Source URL: www.fmi.uni-sofia.bg Language: English - Date: 2013-11-11 20:32:42 Mathematics Turing degree Turing reduction Turing jump Enumeration Low Recursively enumerable set Arithmetical hierarchy Halting problem Computability theory Theoretical computer science Mathematical logic

UPDATE